Hierarchical approach for deriving a reproducible unblocked LU factorization

Recursive approach in sparse matrix LU factorization

This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results given here show that the recursive approach may perform comparable to leading software packages for...

LU factorization for feature transformation

Linear feature space transformations are often used for speaker or environment adaptation. Usually, numerical methods are sought to obtain solutions. In this paper, we derive a closed-form solution to ML estimation of full feature transformations. Closed-form solutions are desirable because the problem is quadratic and thus blind numerical analysis may converge to poor local optima. We decompos...

Parallelizing LU Factorization

Systems of linear equations can be represented by matrix equations of the form A~x = ~b. LU Factorization is a method for solving systems in this form by transforming the matrix A into a form that makes backwards and forward susbstitution feasible. A common algorithm for LU factorization is Gaussian elimination, which I used for my serial and parallel implementations. I investigated using async...

Block LU Factorization

Many of the currently popular \block algorithms" are scalar algorithms in which the operations have been grouped and reordered into matrix operations. One genuine block algorithm in practical use is block LU factorization, and this has recently been shown by Demmel and Higham to be unstable in general. It is shown here that block LU factorization is stable if A is block diagonally dominant by c...

LU-AD1 Factorization Algorithm